Queries with segments in Voronoi diagrams
نویسندگان
چکیده
منابع مشابه
Robust Proximity Queries in Implicit Voronoi Diagrams
In the context of methodologies intended to confer robustness to geometric algorithms , we elaborate on the exact computation paradigm and formalize the notion of degree of a geometric algorithm, as a worst-case quantiication of the precision (number of bits) to which arithmetic calculation have to be executed in order to guarantee topological correctness. We also propose a formalism for the ex...
متن کاملQueries on Voronoi Diagrams of Moving Points
Suppose we are given n moving postmen described by their motion equations p i (t) = s i + v i t; i = 1; : : : ; n, where s i 2 I R 2 is the position of the i'th postman at time t = 0, and v i 2 I R 2 is his velocity. The problem we address is how to preprocess the postmen data so as to be able to eeciently answer two types of nearest-neighbor queries. The rst one asks who is the nearest postman...
متن کاملOn Higher Order Voronoi Diagrams of Line Segments
We analyze structural properties of the order-k Voronoi diagram of line segments, which surprisingly has not received any attention in the computational geometry literature. We show that order-k Voronoi regions of line segments may be disconnected; in fact a single orderk Voronoi region may consist of Ω(n) disjoint faces. Nevertheless, the structural complexity of the order-k Voronoi diagram of...
متن کاملAdditively Weighted Voronoi Diagrams for Optimal Sequenced Route Queries
The Optimal Sequenced Route (OSR) query strives to find a route of minimum length starting from a given source location and passing through a number of typed locations in a specific sequence imposed on the types of the locations. In this paper, we propose a precomputation approach to OSR query in vector spaces. We exploit the geometric properties of the solution space and theoretically prove it...
متن کاملConic nearest neighbor queries and approximate Voronoi diagrams
Given a cone C and a set S of n points in R, we want to preprocess S into a data structure so that we can find fast an approximate nearest neighbor to a query point q with respect to the points of S contained in the translation of C with apex at q. We develop an approximate conic Voronoi diagram of Õ(n/ε) size that supports conic nearest neighbor queries in O(log(n/ε)) time. Our preprocessing u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2000
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(99)00055-3